0.11/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.11 % Command : run_E %s %d THM 0.11/0.32 % Computer : n029.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1440 0.11/0.32 % WCLimit : 180 0.11/0.32 % DateTime : Thu Jul 4 06:10:09 EDT 2024 0.11/0.32 % CPUTime : 0.19/0.47 Running higher-order theorem proving 0.19/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p 1.20/0.66 # Version: 3.2.0-ho 1.20/0.66 # Preprocessing class: HSLSSMSMSSSNHFA. 1.20/0.66 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 1.20/0.66 # Starting new_ho_10 with 900s (5) cores 1.20/0.66 # Starting new_ho_10_cnf2 with 180s (1) cores 1.20/0.66 # Starting full_lambda_6 with 180s (1) cores 1.20/0.66 # Starting full_lambda_9 with 180s (1) cores 1.20/0.66 # new_ho_10_cnf2 with pid 24554 completed with status 0 1.20/0.66 # Result found by new_ho_10_cnf2 1.20/0.66 # Preprocessing class: HSLSSMSMSSSNHFA. 1.20/0.66 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 1.20/0.66 # Starting new_ho_10 with 900s (5) cores 1.20/0.66 # Starting new_ho_10_cnf2 with 180s (1) cores 1.20/0.66 # No SInE strategy applied 1.20/0.66 # Search class: HGHSM-FSLM31-MHFFFSBC 1.20/0.66 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.20/0.66 # Starting lpo1_lambda_fix with 98s (1) cores 1.20/0.66 # lpo1_lambda_fix with pid 24564 completed with status 0 1.20/0.66 # Result found by lpo1_lambda_fix 1.20/0.66 # Preprocessing class: HSLSSMSMSSSNHFA. 1.20/0.66 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 1.20/0.66 # Starting new_ho_10 with 900s (5) cores 1.20/0.66 # Starting new_ho_10_cnf2 with 180s (1) cores 1.20/0.66 # No SInE strategy applied 1.20/0.66 # Search class: HGHSM-FSLM31-MHFFFSBC 1.20/0.66 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 1.20/0.66 # Starting lpo1_lambda_fix with 98s (1) cores 1.20/0.66 # Preprocessing time : 0.008 s 1.20/0.66 # Presaturation interreduction done 1.20/0.66 1.20/0.66 # Proof found! 1.20/0.66 # SZS status Theorem 1.20/0.66 # SZS output start CNFRefutation 1.20/0.66 thf(decl_sort1, type, nat: $tType). 1.20/0.66 thf(decl_sort2, type, list_c1059388851t_unit: $tType). 1.20/0.66 thf(decl_46, type, suc: nat > nat). 1.20/0.66 thf(decl_47, type, size_s1406904903t_unit: list_c1059388851t_unit > nat). 1.20/0.66 thf(decl_49, type, ord_less_nat: nat > nat > $o). 1.20/0.66 thf(decl_50, type, ord_less_eq_nat: nat > nat > $o). 1.20/0.66 thf(decl_54, type, fe: nat > list_c1059388851t_unit). 1.20/0.66 thf(decl_57, type, index: nat). 1.20/0.66 thf(decl_60, type, n1: nat). 1.20/0.66 thf(decl_61, type, nMsg: nat). 1.20/0.66 thf(fact_160_not__less__eq__eq, axiom, ![X2:nat, X1:nat]:((~((ord_less_eq_nat @ X2 @ X1))<=>(ord_less_eq_nat @ (suc @ X1) @ X2))), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', fact_160_not__less__eq__eq)). 1.20/0.66 thf(conj_0, conjecture, (ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index))), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', conj_0)). 1.20/0.66 thf(fact_13_nat__neq__iff, axiom, ![X2:nat, X1:nat]:((((X2)!=(X1))<=>((ord_less_nat @ X1 @ X2)|(ord_less_nat @ X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', fact_13_nat__neq__iff)). 1.20/0.66 thf(fact_166_less__or__eq__imp__le, axiom, ![X2:nat, X1:nat]:(((((X2)=(X1))|(ord_less_nat @ X2 @ X1))=>(ord_less_eq_nat @ X2 @ X1))), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', fact_166_less__or__eq__imp__le)). 1.20/0.66 thf(fact_29_less__trans__Suc, axiom, ![X6:nat, X7:nat, X31:nat]:(((ord_less_nat @ X6 @ X7)=>((ord_less_nat @ X7 @ X31)=>(ord_less_nat @ (suc @ X6) @ X31)))), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', fact_29_less__trans__Suc)). 1.20/0.66 thf(fact_0_AssumpGreaterOccurrence_I1_J, axiom, ~((ord_less_nat @ nMsg @ n1)), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', fact_0_AssumpGreaterOccurrence_I1_J)). 1.20/0.66 thf(fact_1__092_060open_062nMsg_A_060_Alength_A_Ife_Aindex_J_092_060close_062, axiom, (ord_less_nat @ nMsg @ (size_s1406904903t_unit @ (fe @ index))), file('/export/starexec/sandbox2/tmp/tmp.zxt1NwDa2Y/E---3.1_24426.p', fact_1__092_060open_062nMsg_A_060_Alength_A_Ife_Aindex_J_092_060close_062)). 1.20/0.66 thf(c_0_7, plain, ![X2:nat, X1:nat]:((~(ord_less_eq_nat @ X2 @ X1)<=>(ord_less_eq_nat @ (suc @ X1) @ X2))), inference(fof_simplification,[status(thm)],[fact_160_not__less__eq__eq])). 1.20/0.66 thf(c_0_8, negated_conjecture, ~(ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 1.20/0.66 thf(c_0_9, plain, ![X2:nat, X1:nat]:((((X2)!=(X1))<=>((ord_less_nat @ X1 @ X2)|(ord_less_nat @ X2 @ X1)))), inference(fof_simplification,[status(thm)],[fact_13_nat__neq__iff])). 1.20/0.66 thf(c_0_10, plain, ![X1179:nat, X1180:nat]:((((ord_less_eq_nat @ X1179 @ X1180)|(ord_less_eq_nat @ (suc @ X1180) @ X1179))&(~(ord_less_eq_nat @ (suc @ X1180) @ X1179)|~(ord_less_eq_nat @ X1179 @ X1180)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])). 1.20/0.66 thf(c_0_11, plain, ![X846:nat, X847:nat]:(((((X846)!=(X847))|(ord_less_eq_nat @ X846 @ X847))&(~(ord_less_nat @ X846 @ X847)|(ord_less_eq_nat @ X846 @ X847)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_166_less__or__eq__imp__le])])])])). 1.20/0.66 thf(c_0_12, negated_conjecture, ~(ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index))), inference(fof_nnf,[status(thm)],[c_0_8])). 1.20/0.66 thf(c_0_13, plain, ![X927:nat, X928:nat]:(((((X927)=(X928))|((ord_less_nat @ X928 @ X927)|(ord_less_nat @ X927 @ X928)))&((~(ord_less_nat @ X928 @ X927)|((X927)!=(X928)))&(~(ord_less_nat @ X927 @ X928)|((X927)!=(X928)))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])). 1.20/0.66 thf(c_0_14, plain, ![X2:nat, X1:nat]:((~((ord_less_eq_nat @ (suc @ X1) @ X2))|~((ord_less_eq_nat @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_10])). 1.20/0.66 thf(c_0_15, plain, ![X1:nat, X2:nat]:(((ord_less_eq_nat @ X1 @ X2)|~((ord_less_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_11])). 1.20/0.66 thf(c_0_16, plain, ![X765:nat, X766:nat, X767:nat]:((~(ord_less_nat @ X765 @ X766)|(~(ord_less_nat @ X766 @ X767)|(ord_less_nat @ (suc @ X765) @ X767)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_29_less__trans__Suc])])])). 1.20/0.66 thf(c_0_17, negated_conjecture, ~((ord_less_nat @ n1 @ (size_s1406904903t_unit @ (fe @ index)))), inference(split_conjunct,[status(thm)],[c_0_12])). 1.20/0.66 thf(c_0_18, plain, ![X1:nat, X2:nat]:((((X1)=(X2))|(ord_less_nat @ X2 @ X1)|(ord_less_nat @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_13])). 1.20/0.66 thf(c_0_19, plain, ![X2:nat, X1:nat]:((~((ord_less_nat @ (suc @ X1) @ X2))|~((ord_less_eq_nat @ X2 @ X1)))), inference(spm,[status(thm)],[c_0_14, c_0_15])). 1.20/0.66 thf(c_0_20, plain, ![X1:nat, X2:nat, X3:nat]:(((ord_less_nat @ (suc @ X1) @ X3)|~((ord_less_nat @ X1 @ X2))|~((ord_less_nat @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_16])). 1.20/0.66 thf(c_0_21, negated_conjecture, (((n1)=(size_s1406904903t_unit @ (fe @ index)))|(ord_less_nat @ (size_s1406904903t_unit @ (fe @ index)) @ n1)), inference(spm,[status(thm)],[c_0_17, c_0_18])). 1.20/0.66 thf(c_0_22, plain, ![X2:nat, X1:nat]:((~((ord_less_nat @ (suc @ X1) @ X2))|~((ord_less_nat @ X2 @ X1)))), inference(spm,[status(thm)],[c_0_19, c_0_15])). 1.20/0.66 thf(c_0_23, negated_conjecture, ![X1:nat]:((((n1)=(size_s1406904903t_unit @ (fe @ index)))|(ord_less_nat @ (suc @ X1) @ n1)|~((ord_less_nat @ X1 @ (size_s1406904903t_unit @ (fe @ index)))))), inference(spm,[status(thm)],[c_0_20, c_0_21])). 1.20/0.66 thf(c_0_24, plain, ~(ord_less_nat @ nMsg @ n1), inference(fof_simplification,[status(thm)],[fact_0_AssumpGreaterOccurrence_I1_J])). 1.20/0.66 thf(c_0_25, negated_conjecture, ![X1:nat]:((((n1)=(size_s1406904903t_unit @ (fe @ index)))|~((ord_less_nat @ X1 @ (size_s1406904903t_unit @ (fe @ index))))|~((ord_less_nat @ n1 @ X1)))), inference(spm,[status(thm)],[c_0_22, c_0_23])). 1.20/0.66 thf(c_0_26, plain, (ord_less_nat @ nMsg @ (size_s1406904903t_unit @ (fe @ index))), inference(split_conjunct,[status(thm)],[fact_1__092_060open_062nMsg_A_060_Alength_A_Ife_Aindex_J_092_060close_062])). 1.20/0.66 thf(c_0_27, plain, ~(ord_less_nat @ nMsg @ n1), inference(fof_nnf,[status(thm)],[c_0_24])). 1.20/0.66 thf(c_0_28, negated_conjecture, (((n1)=(size_s1406904903t_unit @ (fe @ index)))|~((ord_less_nat @ n1 @ nMsg))), inference(spm,[status(thm)],[c_0_25, c_0_26])). 1.20/0.66 thf(c_0_29, plain, ~((ord_less_nat @ nMsg @ n1)), inference(split_conjunct,[status(thm)],[c_0_27])). 1.20/0.66 thf(c_0_30, negated_conjecture, (((n1)=(size_s1406904903t_unit @ (fe @ index)))|((n1)=(nMsg))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_18]), c_0_29])). 1.20/0.66 thf(c_0_31, negated_conjecture, ((n1)=(size_s1406904903t_unit @ (fe @ index))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_30]), c_0_26])])). 1.20/0.66 thf(c_0_32, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29, c_0_31]), c_0_26])]), ['proof']). 1.20/0.66 # SZS output end CNFRefutation 1.20/0.66 # Parsed axioms : 309 1.20/0.66 # Removed by relevancy pruning/SinE : 0 1.20/0.66 # Initial clauses : 491 1.20/0.66 # Removed in clause preprocessing : 67 1.20/0.66 # Initial clauses in saturation : 424 1.20/0.66 # Processed clauses : 1383 1.20/0.66 # ...of these trivial : 30 1.20/0.66 # ...subsumed : 594 1.20/0.66 # ...remaining for further processing : 759 1.20/0.66 # Other redundant clauses eliminated : 73 1.20/0.66 # Clauses deleted for lack of memory : 0 1.20/0.66 # Backward-subsumed : 18 1.20/0.66 # Backward-rewritten : 32 1.20/0.66 # Generated clauses : 3229 1.20/0.66 # ...of the previous two non-redundant : 2770 1.20/0.66 # ...aggressively subsumed : 0 1.20/0.66 # Contextual simplify-reflections : 1 1.20/0.66 # Paramodulations : 3053 1.20/0.66 # Factorizations : 5 1.20/0.66 # NegExts : 0 1.20/0.66 # Equation resolutions : 74 1.20/0.66 # Disequality decompositions : 0 1.20/0.66 # Total rewrite steps : 775 1.20/0.66 # ...of those cached : 628 1.20/0.66 # Propositional unsat checks : 0 1.20/0.66 # Propositional check models : 0 1.20/0.66 # Propositional check unsatisfiable : 0 1.20/0.66 # Propositional clauses : 0 1.20/0.66 # Propositional clauses after purity: 0 1.20/0.66 # Propositional unsat core size : 0 1.20/0.66 # Propositional preprocessing time : 0.000 1.20/0.66 # Propositional encoding time : 0.000 1.20/0.66 # Propositional solver time : 0.000 1.20/0.66 # Success case prop preproc time : 0.000 1.20/0.66 # Success case prop encoding time : 0.000 1.20/0.66 # Success case prop solver time : 0.000 1.20/0.66 # Current number of processed clauses : 335 1.20/0.66 # Positive orientable unit clauses : 79 1.20/0.66 # Positive unorientable unit clauses: 1 1.20/0.66 # Negative unit clauses : 65 1.20/0.66 # Non-unit-clauses : 190 1.20/0.66 # Current number of unprocessed clauses: 2110 1.20/0.66 # ...number of literals in the above : 5020 1.20/0.66 # Current number of archived formulas : 0 1.20/0.66 # Current number of archived clauses : 381 1.20/0.66 # Clause-clause subsumption calls (NU) : 26546 1.20/0.66 # Rec. Clause-clause subsumption calls : 14171 1.20/0.66 # Non-unit clause-clause subsumptions : 225 1.20/0.66 # Unit Clause-clause subsumption calls : 1290 1.20/0.66 # Rewrite failures with RHS unbound : 0 1.20/0.66 # BW rewrite match attempts : 54 1.20/0.66 # BW rewrite match successes : 24 1.20/0.66 # Condensation attempts : 0 1.20/0.66 # Condensation successes : 0 1.20/0.66 # Termbank termtop insertions : 82815 1.20/0.66 # Search garbage collected termcells : 9785 1.20/0.66 1.20/0.66 # ------------------------------------------------- 1.20/0.66 # User time : 0.129 s 1.20/0.66 # System time : 0.011 s 1.20/0.66 # Total time : 0.140 s 1.20/0.66 # Maximum resident set size: 3912 pages 1.20/0.66 1.20/0.66 # ------------------------------------------------- 1.20/0.66 # User time : 0.139 s 1.20/0.66 # System time : 0.013 s 1.20/0.66 # Total time : 0.152 s 1.20/0.66 # Maximum resident set size: 2172 pages 1.20/0.66 % E---3.1 exiting 1.20/0.67 % E exiting 1.20/0.67 EOF